On graphs and codes preserved by edge local complementation
نویسندگان
چکیده
منابع مشابه
On graphs and codes preserved by edge local complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and errorcorrecting codes. We define a new graph class, ELC-preserved graphs, comprising all graphs that have an ELC orbit of size one. Through an exhaustive search, we find all ELC-preserved graphs o...
متن کاملEdge local complementation and equivalence of binary linear codes
Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. The information sets and the minimum distance of a code can be derived from the corresponding ELC orbit. By extending earlier results on local complementation (LC) orbits, we classify the ELC orbits of al...
متن کاملStructures Preserved by Schur Complementation
In this paper we investigate some matrix structures on C that have a good behaviour under Schur complementation. The first type of structure is closely related to low displacement rank matrices. Next, we show that for a matrix having a low rank submatrix, also the Schur complement must have a low rank submatrix, which we can explicitly determine. This property holds even if the low rank submatr...
متن کاملRandom Edge-Local Complementation With Applications to Iterative Decoding of HDPC Codes
This paper describes the application of edge-local complementation (ELC), defined for a simple bipartite graph, to a Tanner graph associated with a binary linear code, C. From a code perspective, various properties of ELC are described and discussed, mainly the special case of isomorphic ELC operations and the relationship to the automorphism group of the code, Aut(C), as well as the generaliza...
متن کاملEdge-local equivalence of graphs
The local complement G ∗ i of a simple graph G at one of its vertices i is obtained by complementing the subgraph induced by the neighborhood of i and leaving the rest of the graph unchanged. If e = {i, j} is an edge of G then G ∗ e = ((G ∗ i) ∗ j) ∗ i is called the edge-local complement of G along the edge e. We call two graphs edge-locally equivalent if they are related by a sequence of edge-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2013
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-013-9876-6